Implementing a deterministic search algorithm with a single qubit

نویسندگان

چکیده

Abstract Quantum search algorithms have important applications in quantum information, which been experimentally demonstrated several systems with database sizes up to 16. We first propose an efficient scheme based on optimized Grover’s algorithm and a novel encoding method. With this scheme, target element can be deterministically searched large using only single qubit. Then we implement linear optics 40. Experimental results fit well the theoretical results, all fidelities greater than 99.7%. The limitation of number elements encoded qubit is also investigated experiment. experimental indicate that state successfully from size 36 our laboratory. Since one one-qubit gates are required, quite general, adopted same task most systems.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Using a new modified harmony search algorithm to solve multi-objective reactive power dispatch in deterministic and stochastic models

The optimal reactive power dispatch (ORPD) is a very important problem aspect of power system planning and is a highly nonlinear, non-convex optimization problem because consist of both continuous and discrete control variables. Since the power system has inherent uncertainty, hereby, this paper presents both of the deterministic and stochastic models for ORPD problem in multi objective and sin...

متن کامل

Multi-Qubit Dynamics Quantum Search Algorithm

Following the experimental work [M. W. Johnson, et al. Nature 473, 194 (2011)], we propose a new physical scheme for perfect implementation of quantum search algorithm in presence of the dissipation of qubits. Applying all the required steps for implementing the algorithm, the quantum gates are generated from the suggested model. During a critical portion of quantum annealing, the qubits become...

متن کامل

Repeat-until-success: non-deterministic decomposition of single-qubit unitaries

We present a non-deterministic circuit decomposition technique for approximating an arbitrary single-qubit unitary to within distance that requires significantly fewer non-Clifford gates than deterministic decomposition techniques. We develop “Repeat-Until-Success” (RUS) circuits and characterize unitaries that can be exactly represented as an RUS circuit. Our RUS circuits operate by conditioni...

متن کامل

Locking entanglement with a single qubit.

We study the loss of entanglement of a bipartite state subjected to discarding or measurement of one qubit. Examining behavior of different entanglement measures, we find that entanglement of formation, entanglement cost, logarithmic negativity, and one-way distillable entanglement are lockable measures in that they can decrease arbitrarily after measuring one qubit. We prove that any convex an...

متن کامل

Guided Search and a Faster Deterministic Algorithm for 3-SAT

Most deterministic algorithms for NP-hard problems are splitting algorithms: They split a problem instance into several smaller ones, which they solve recursively. Often, the algorithm has a choice between several splittings. For 3-SAT, we show that choosing wisely which splitting to apply, one can avoid encountering too many worst-case instances. This improves the currently best known determin...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Progress of theoretical and experimental physics

سال: 2023

ISSN: ['1347-4081', '0033-068X']

DOI: https://doi.org/10.1093/ptep/ptad032